Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Operations scheduling with applications in manufacturing and services / Michael Pinedo, Xiuli Chao
| Operations scheduling with applications in manufacturing and services / Michael Pinedo, Xiuli Chao |
| Autore | PINEDO, Michael |
| Pubbl/distr/stampa | Boston [etc.] : Irvin McGraw-Hill, c1999 |
| Descrizione fisica | IX, 310 p. ; 25 cm. + 2 floppy disk |
| Disciplina | 658.53 |
| Altri autori (Persone) | CHAO, Xiuli |
| Collana | Computer science series |
| Soggetto topico | Produzione - Programmazione |
| ISBN | 0-07-116675-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990002844770203316 |
PINEDO, Michael
|
||
| Boston [etc.] : Irvin McGraw-Hill, c1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Planning and scheduling in manufacturing and services / Michael L. Pinedo
| Planning and scheduling in manufacturing and services / Michael L. Pinedo |
| Autore | Pinedo, Michael L. |
| Edizione | [2. ed] |
| Pubbl/distr/stampa | Dordrecht, : Springer, 2009 |
| Descrizione fisica | XVIII, 536 p. : ill. ; 25 cm + 1 CD-ROM |
| Disciplina |
658.5
658.53 |
| Soggetto topico | Aziende industriali - Piani di produzione |
| ISBN | 9781441909091 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-PMI0008423 |
|
Pinedo, Michael L.
|
||
| Dordrecht, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||
Planning and scheduling in manufacturing and services / Michael L. Pinedo
| Planning and scheduling in manufacturing and services / Michael L. Pinedo |
| Autore | Pinedo, Michael |
| Pubbl/distr/stampa | New York, NY : Springer, c2005 |
| Descrizione fisica | xvi, 506 p. : ill. 24 cm + 1 CD-ROM |
| Disciplina | 658.53 |
| Collana | Springer series in operations research |
| Soggetto topico |
Production scheduling
Production planning |
| ISBN | 9780387221984 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991003700489707536 |
|
Pinedo, Michael
|
||
| New York, NY : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Planning and scheduling in manufacturing and services [e-book] / by Michael L. Pinedo
| Planning and scheduling in manufacturing and services [e-book] / by Michael L. Pinedo |
| Autore | Pinedo, Michael L. |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | New York, NY : Springer, 2009 |
| Descrizione fisica | v.: digital |
| Soggetto topico |
Operations research
Economics Business planning Business logistics |
| ISBN | 9781441909107 |
| Formato | Software  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991001286119707536 |
|
Pinedo, Michael L.
|
||
| New York, NY : Springer, 2009 | ||
| Software | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Queueing networks : customers, signals, and product form solutions / Xiuli Chao, Masakiyo Miyazawa, Michael Pinedo
| Queueing networks : customers, signals, and product form solutions / Xiuli Chao, Masakiyo Miyazawa, Michael Pinedo |
| Autore | Chao, Xiuli |
| Pubbl/distr/stampa | Chichester [etc.] : John Wiley & Sons, c1999 |
| Descrizione fisica | xii, 445 p. : ill. ; 24 cm |
| Disciplina | 658.53 |
| Altri autori (Persone) |
Miyazawa, Masakiyo
Pinedo, Michael |
| Collana | Wiley-Interscience series in systems and optimization |
| Soggetto non controllato |
Ricerca operativa - Management science
Teoria delle code Organizzazione sistemica dei computers - Valutazione delle prestazioni |
| ISBN | 0-471-98309-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990001225750403321 |
|
Chao, Xiuli
|
||
| Chichester [etc.] : John Wiley & Sons, c1999 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Scheduling : theory, algorithms, and systems / / Michael L. Pinedo
| Scheduling : theory, algorithms, and systems / / Michael L. Pinedo |
| Autore | Pinedo Michael |
| Edizione | [Sixth edition.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (691 pages) |
| Disciplina | 658.53 |
| Soggetto topico | Production scheduling |
| ISBN |
9783031059216
9783031059209 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface to the Sixth Edition -- The Gantt Chart: Its Originators -- Supplementary Electronic Material -- Contents -- 1 Introduction -- 1.1 The Role of Scheduling -- 1.2 The Scheduling Function in an Enterprise -- 1.3 Outline of the Book -- Part I Deterministic Models -- 2 Deterministic Models: Preliminaries -- 2.1 Framework and Notation -- 2.2 Examples -- 2.3 Classes of Schedules -- 2.4 Complexity Hierarchy -- 3 Single Machine Models (Deterministic) -- 3.1 The Total Weighted Completion Time -- 3.2 The Maximum Lateness -- 3.3 The Number of Tardy Jobs -- 3.4 The Total Tardiness-Dynamic Programming -- 3.5 The Total Tardiness-An Approximation Scheme -- 3.6 The Total Weighted Tardiness -- 3.7 Online Scheduling -- 3.8 Discussion -- 4 Advanced Single Machine Models (Deterministic) -- 4.1 The Total Earliness and Tardiness -- 4.2 Primary and Secondary Objectives -- 4.3 Multiple Objectives: A Parametric Analysis -- 4.4 The Makespan with Sequence Dependent Setup Times -- 4.5 Job Families with Setup Times -- 4.6 Batch Processing -- 4.7 Discussion -- 5 Parallel Machine Models (Deterministic) -- 5.1 The Makespan without Preemptions -- 5.2 The Makespan with Preemptions -- 5.3 The Total Completion Time without Preemptions -- 5.4 The Total Completion Time with Preemptions -- 5.5 Due Date Related Objectives -- 5.6 Online Scheduling -- 5.7 Discussion -- 6 Flow Shops and Flexible Flow Shops (Deterministic) -- 6.1 Flow Shops with Unlimited Intermediate Storage -- 6.2 Flow Shops with Limited Intermediate Storage -- 6.3 Proportionate Flow Shops with Unlimited and Limited Intermediate Storage -- 6.4 Proportionate Flow Shops with Reentry -- 6.5 Flexible Flow Shops with Unlimited Intermediate Storage -- 6.6 Discussion -- 7 Job Shops (Deterministic) -- 7.1 Disjunctive Programming and Branch and Bound -- 7.2 The Shifting Bottleneck Heuristic and the Makespan.
7.3 The Shifting Bottleneck Heuristic and the Total Weighted Tardiness -- 7.4 Constraint Programming and the Makespan -- 7.5 Discussion -- 8 Open Shops (Deterministic) -- 8.1 The Makespan without Preemptions -- 8.2 The Makespan with Preemptions -- 8.3 The Maximum Lateness without Preemptions -- 8.4 The Maximum Lateness with Preemptions -- 8.5 The Number of Tardy Jobs -- 8.6 Discussion -- Part II Stochastic Models -- 9 Stochastic Models: Preliminaries -- 9.1 Framework and Notation -- 9.2 Distributions and Classes of Distributions -- 9.3 Stochastic Dominance -- 9.4 Impact of Randomness on Fixed Schedules -- 9.5 Classes of Policies -- 10 Single Machine Models (Stochastic) -- 10.1 Arbitrary Distributions without Preemptions -- 10.2 Arbitrary Distributions with Preemptions: the Gittins Index -- 10.3 Likelihood Ratio Ordered Distributions -- 10.4 Exponential Distributions -- 10.5 Discussion -- 11 Single Machine Models with Release Dates (Stochastic) -- 11.1 Arbitrary Release Dates and Arbitrary Processing Times without Preemptions -- 11.2 Priority Queues, Work Conservation, and Poisson Releases -- 11.3 Arbitrary Releases and Exponential Processing Times with Preemptions -- 11.4 Poisson Releases and Arbitrary Processing Times without Preemptions -- 11.5 Discussion -- 12 Parallel Machine Models (Stochastic) -- 12.1 The Makespan and Total Completion Time without Preemptions -- 12.2 The Makespan and Total Completion Time with Preemptions -- 12.3 Due Date Related Objectives -- 12.4 Bounds Obtained through Online Scheduling -- 12.5 Discussion -- 13 Flow Shops, Job Shops, and Open Shops (Stochastic) -- 13.1 Stochastic Flow Shops with Unlimited Intermediate Storage -- 13.2 Stochastic Flow Shops with Blocking -- 13.3 Stochastic Job Shops -- 13.4 Stochastic Open Shops -- 13.5 Discussion -- Part III Scheduling in Practice. 14 General Purpose Procedures for Deterministic Scheduling -- 14.1 Dispatching Rules -- 14.2 Composite Dispatching Rules -- 14.3 Local Search: Simulated Annealing and Tabu-Search -- 14.4 Local Search: Genetic Algorithms -- 14.5 Ant Colony Optimization -- 14.6 Discussion -- 15 More Advanced General Purpose Procedures -- 15.1 Beam Search -- 15.2 Decomposition Methods and Rolling Horizon Procedures -- 15.3 Constraint Programming -- 15.4 Market-Based and Agent-Based Procedures -- 15.5 Procedures for Scheduling Problems with Multiple Objectives -- 15.6 Discussion -- 16 Modeling and Solving Scheduling Problems in Practice -- 16.1 Scheduling Problems in Practice -- 16.2 Cyclic Scheduling of a Flow Line -- 16.3 Scheduling of a Flexible Flow Line with Limited Buffers and Bypass -- 16.4 Scheduling of a Flexible Flow Line with Unlimited Buffers and Setups -- 16.5 Scheduling a Bank of Parallel Machines with Jobs having Release Dates and Due Dates -- 16.6 Discussion -- 17 Design and Implementation of Scheduling Systems: Basic Concepts -- 17.1 Systems Architecture -- 17.2 Databases, Object Bases, and Knowledge-Bases -- 17.3 Modules for Generating Schedules -- 17.4 User Interfaces and Interactive Optimization -- 17.5 Generic Systems vs. Application-Specific Systems -- 17.6 Implementation and Maintenance Issues -- 18 Design and Implementation of Scheduling Systems: More Advanced Concepts -- 18.1 Robustness and Reactive Decision Making -- 18.2 Machine Learning Mechanisms -- 18.3 Design of Scheduling Engines and Algorithm Libraries -- 18.4 Reconfigurable Systems -- 18.5 Web-Based Scheduling Systems -- 18.6 Discussion -- 19 Examples of System Designs and Implementations -- 19.1 SAP's Production Planning and Detailed Scheduling -- 19.2 IBM's Independent Agents Architecture -- 19.3 AMD's Real Time Dispatching and Agent Scheduling. 19.4 ASPROVA Advanced Planning and Scheduling -- 19.5 SIEMENS Opcenter APS -- 19.6 DELMIA Ortems Production Scheduler -- 19.7 CYBERPLAN - A System Developed by Cybertec -- 19.8 LEKIN - A System Developed in Academia -- 19.9 Discussion -- 20 What Lies Ahead? -- 20.1 Theoretical Research -- 20.2 Applied Research -- 20.3 Systems Development -- Appendices -- A Mathematical Programming: Formulations and Applications -- A.1 Linear Programming Formulations -- A.2 Integer Programming Formulations -- A.3 Bounds, Approximations, and Heuristics Based on Linear Programming -- A.4 Disjunctive Programming Formulations -- B Deterministic and Stochastic Dynamic Programming -- B.1 Deterministic Dynamic Programming -- B.2 Stochastic Dynamic Programming -- C Constraint Programming -- C.1 Constraint Satisfaction -- C.2 Constraint Programming -- C.3 An Example of a Constraint Programming Language -- C.4 Constraint Programming vs. Mathematical Programming -- D Complexity Theory -- D.1 Preliminaries -- D.2 Polynomial Time Solutions versus NP-Hardness -- D.3 Examples -- D.4 Fixed Parameter Tractability -- D.5 Approximation Algorithms and Schemes -- E Complexity Classification of Deterministic Scheduling Problems -- F Overview of Stochastic Scheduling Problems -- G Selected Scheduling Systems -- H The Lekin System -- H.1 Formatting of Input and Output Files -- H.2 Linking Scheduling Programs -- References -- Subject Index -- Name Index. |
| Record Nr. | UNISA-996503551203316 |
|
Pinedo Michael
|
||
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Scheduling : theory, algorithms, and systems / / Michael L. Pinedo
| Scheduling : theory, algorithms, and systems / / Michael L. Pinedo |
| Autore | Pinedo Michael |
| Edizione | [Sixth edition.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2022] |
| Descrizione fisica | 1 online resource (691 pages) |
| Disciplina | 658.53 |
| Soggetto topico | Production scheduling |
| ISBN |
9783031059216
9783031059209 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface to the Sixth Edition -- The Gantt Chart: Its Originators -- Supplementary Electronic Material -- Contents -- 1 Introduction -- 1.1 The Role of Scheduling -- 1.2 The Scheduling Function in an Enterprise -- 1.3 Outline of the Book -- Part I Deterministic Models -- 2 Deterministic Models: Preliminaries -- 2.1 Framework and Notation -- 2.2 Examples -- 2.3 Classes of Schedules -- 2.4 Complexity Hierarchy -- 3 Single Machine Models (Deterministic) -- 3.1 The Total Weighted Completion Time -- 3.2 The Maximum Lateness -- 3.3 The Number of Tardy Jobs -- 3.4 The Total Tardiness-Dynamic Programming -- 3.5 The Total Tardiness-An Approximation Scheme -- 3.6 The Total Weighted Tardiness -- 3.7 Online Scheduling -- 3.8 Discussion -- 4 Advanced Single Machine Models (Deterministic) -- 4.1 The Total Earliness and Tardiness -- 4.2 Primary and Secondary Objectives -- 4.3 Multiple Objectives: A Parametric Analysis -- 4.4 The Makespan with Sequence Dependent Setup Times -- 4.5 Job Families with Setup Times -- 4.6 Batch Processing -- 4.7 Discussion -- 5 Parallel Machine Models (Deterministic) -- 5.1 The Makespan without Preemptions -- 5.2 The Makespan with Preemptions -- 5.3 The Total Completion Time without Preemptions -- 5.4 The Total Completion Time with Preemptions -- 5.5 Due Date Related Objectives -- 5.6 Online Scheduling -- 5.7 Discussion -- 6 Flow Shops and Flexible Flow Shops (Deterministic) -- 6.1 Flow Shops with Unlimited Intermediate Storage -- 6.2 Flow Shops with Limited Intermediate Storage -- 6.3 Proportionate Flow Shops with Unlimited and Limited Intermediate Storage -- 6.4 Proportionate Flow Shops with Reentry -- 6.5 Flexible Flow Shops with Unlimited Intermediate Storage -- 6.6 Discussion -- 7 Job Shops (Deterministic) -- 7.1 Disjunctive Programming and Branch and Bound -- 7.2 The Shifting Bottleneck Heuristic and the Makespan.
7.3 The Shifting Bottleneck Heuristic and the Total Weighted Tardiness -- 7.4 Constraint Programming and the Makespan -- 7.5 Discussion -- 8 Open Shops (Deterministic) -- 8.1 The Makespan without Preemptions -- 8.2 The Makespan with Preemptions -- 8.3 The Maximum Lateness without Preemptions -- 8.4 The Maximum Lateness with Preemptions -- 8.5 The Number of Tardy Jobs -- 8.6 Discussion -- Part II Stochastic Models -- 9 Stochastic Models: Preliminaries -- 9.1 Framework and Notation -- 9.2 Distributions and Classes of Distributions -- 9.3 Stochastic Dominance -- 9.4 Impact of Randomness on Fixed Schedules -- 9.5 Classes of Policies -- 10 Single Machine Models (Stochastic) -- 10.1 Arbitrary Distributions without Preemptions -- 10.2 Arbitrary Distributions with Preemptions: the Gittins Index -- 10.3 Likelihood Ratio Ordered Distributions -- 10.4 Exponential Distributions -- 10.5 Discussion -- 11 Single Machine Models with Release Dates (Stochastic) -- 11.1 Arbitrary Release Dates and Arbitrary Processing Times without Preemptions -- 11.2 Priority Queues, Work Conservation, and Poisson Releases -- 11.3 Arbitrary Releases and Exponential Processing Times with Preemptions -- 11.4 Poisson Releases and Arbitrary Processing Times without Preemptions -- 11.5 Discussion -- 12 Parallel Machine Models (Stochastic) -- 12.1 The Makespan and Total Completion Time without Preemptions -- 12.2 The Makespan and Total Completion Time with Preemptions -- 12.3 Due Date Related Objectives -- 12.4 Bounds Obtained through Online Scheduling -- 12.5 Discussion -- 13 Flow Shops, Job Shops, and Open Shops (Stochastic) -- 13.1 Stochastic Flow Shops with Unlimited Intermediate Storage -- 13.2 Stochastic Flow Shops with Blocking -- 13.3 Stochastic Job Shops -- 13.4 Stochastic Open Shops -- 13.5 Discussion -- Part III Scheduling in Practice. 14 General Purpose Procedures for Deterministic Scheduling -- 14.1 Dispatching Rules -- 14.2 Composite Dispatching Rules -- 14.3 Local Search: Simulated Annealing and Tabu-Search -- 14.4 Local Search: Genetic Algorithms -- 14.5 Ant Colony Optimization -- 14.6 Discussion -- 15 More Advanced General Purpose Procedures -- 15.1 Beam Search -- 15.2 Decomposition Methods and Rolling Horizon Procedures -- 15.3 Constraint Programming -- 15.4 Market-Based and Agent-Based Procedures -- 15.5 Procedures for Scheduling Problems with Multiple Objectives -- 15.6 Discussion -- 16 Modeling and Solving Scheduling Problems in Practice -- 16.1 Scheduling Problems in Practice -- 16.2 Cyclic Scheduling of a Flow Line -- 16.3 Scheduling of a Flexible Flow Line with Limited Buffers and Bypass -- 16.4 Scheduling of a Flexible Flow Line with Unlimited Buffers and Setups -- 16.5 Scheduling a Bank of Parallel Machines with Jobs having Release Dates and Due Dates -- 16.6 Discussion -- 17 Design and Implementation of Scheduling Systems: Basic Concepts -- 17.1 Systems Architecture -- 17.2 Databases, Object Bases, and Knowledge-Bases -- 17.3 Modules for Generating Schedules -- 17.4 User Interfaces and Interactive Optimization -- 17.5 Generic Systems vs. Application-Specific Systems -- 17.6 Implementation and Maintenance Issues -- 18 Design and Implementation of Scheduling Systems: More Advanced Concepts -- 18.1 Robustness and Reactive Decision Making -- 18.2 Machine Learning Mechanisms -- 18.3 Design of Scheduling Engines and Algorithm Libraries -- 18.4 Reconfigurable Systems -- 18.5 Web-Based Scheduling Systems -- 18.6 Discussion -- 19 Examples of System Designs and Implementations -- 19.1 SAP's Production Planning and Detailed Scheduling -- 19.2 IBM's Independent Agents Architecture -- 19.3 AMD's Real Time Dispatching and Agent Scheduling. 19.4 ASPROVA Advanced Planning and Scheduling -- 19.5 SIEMENS Opcenter APS -- 19.6 DELMIA Ortems Production Scheduler -- 19.7 CYBERPLAN - A System Developed by Cybertec -- 19.8 LEKIN - A System Developed in Academia -- 19.9 Discussion -- 20 What Lies Ahead? -- 20.1 Theoretical Research -- 20.2 Applied Research -- 20.3 Systems Development -- Appendices -- A Mathematical Programming: Formulations and Applications -- A.1 Linear Programming Formulations -- A.2 Integer Programming Formulations -- A.3 Bounds, Approximations, and Heuristics Based on Linear Programming -- A.4 Disjunctive Programming Formulations -- B Deterministic and Stochastic Dynamic Programming -- B.1 Deterministic Dynamic Programming -- B.2 Stochastic Dynamic Programming -- C Constraint Programming -- C.1 Constraint Satisfaction -- C.2 Constraint Programming -- C.3 An Example of a Constraint Programming Language -- C.4 Constraint Programming vs. Mathematical Programming -- D Complexity Theory -- D.1 Preliminaries -- D.2 Polynomial Time Solutions versus NP-Hardness -- D.3 Examples -- D.4 Fixed Parameter Tractability -- D.5 Approximation Algorithms and Schemes -- E Complexity Classification of Deterministic Scheduling Problems -- F Overview of Stochastic Scheduling Problems -- G Selected Scheduling Systems -- H The Lekin System -- H.1 Formatting of Input and Output Files -- H.2 Linking Scheduling Programs -- References -- Subject Index -- Name Index. |
| Record Nr. | UNINA-9910635388903321 |
|
Pinedo Michael
|
||
| Cham, Switzerland : , : Springer, , [2022] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Scheduling : theory, algorithms, and systems / Michael L. Pinedo
| Scheduling : theory, algorithms, and systems / Michael L. Pinedo |
| Autore | Pinedo, Michael L. |
| Edizione | [5. ed] |
| Pubbl/distr/stampa | Cham, : Springer, 2016 |
| Descrizione fisica | XX, 670 p. : ill. ; 24 cm |
| Soggetto topico |
60K37 - Processes in random environments [MSC 2020]
68M20 - Performance evaluation, queueing, and scheduling in the context of computer systems [MSC 2020] 90-XX - Operations research, mathematical programming [MSC 2020] 90B36 - Scheduling theory, stochastic in operations research [MSC 2020] 90B35 - Scheduling theory, deterministic in operations research [MSC 2020] |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-SUN0115337 |
|
Pinedo, Michael L.
|
||
| Cham, : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Scheduling [[electronic resource] ] : Theory, Algorithms, and Systems / / by Michael L. Pinedo
| Scheduling [[electronic resource] ] : Theory, Algorithms, and Systems / / by Michael L. Pinedo |
| Autore | Pinedo Michael L |
| Edizione | [5th ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XX, 670 p. 124 illus., 21 illus. in color.) |
| Disciplina | 658.53 |
| Soggetto topico |
Operations research
Management science Industrial engineering Production engineering Probabilities System theory Operations Research, Management Science Industrial and Production Engineering Probability Theory and Stochastic Processes Systems Theory, Control |
| ISBN | 3-319-26580-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Supplementary Electronic Material -- Introduction -- Part I: Deterministic Models -- Deterministic Models: Preliminaries -- Single Machine Models (Deterministic) -- Advanced Single Machine Models (Deterministic) -- Parallel Machines Models (Deterministic) -- Flow Shops and Flexible Flow Shops (Deterministic) -- Job Shops (Deterministic) -- Open Shops (Deterministic) -- Part II Stochastic Models -- Stochastic Models: Preliminaries -- Single Machine Models (Stochastic) -- Single Machine Models with Release Dates (Stochastic) -- Parallel Machine Models (Stochastic) -- Flow Shops, Job Shops and Open Shops (Stochastic) -- Part III Scheduling in Practice -- General Purpose Procedures for Deterministic Scheduling -- More Advanced General Purpose Procedures -- Modeling and Solving Scheduling Problems in Practice -- Design and Implementation of Scheduling Systems: Basic Concepts -- Design and Implementation of Scheduling Systems: More Advanced Concepts -- Examples of System Designs and Implementations -- What Lies Ahead? -- Appendices. |
| Record Nr. | UNINA-9910254081603321 |
|
Pinedo Michael L
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Scheduling : theory, algorithms, and systems / Michael L. Pinedo
| Scheduling : theory, algorithms, and systems / Michael L. Pinedo |
| Autore | Pinedo, Michael L. |
| Edizione | [5. ed] |
| Pubbl/distr/stampa | Cham, : Springer, 2016 |
| Descrizione fisica | XX, 670 p. : ill. ; 24 cm |
| Soggetto topico |
60K37 - Processes in random environments [MSC 2020]
68M20 - Performance evaluation, queueing, and scheduling in the context of computer systems [MSC 2020] 90-XX - Operations research, mathematical programming [MSC 2020] 90B36 - Scheduling theory, stochastic in operations research [MSC 2020] 90B35 - Scheduling theory, deterministic in operations research [MSC 2020] |
| Soggetto non controllato |
Applications of schedule
Decision making Deterministic models Scheduling Stochastic models |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0115337 |
|
Pinedo, Michael L.
|
||
| Cham, : Springer, 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
